Weakly Distance-regular Digraphs
نویسندگان
چکیده
منابع مشابه
Weakly Distance-Regular Digraphs of Girth 2
In this paper, we give two constructions of weakly distance-regular digraphs of girth 2, and prove that certain quotient digraph of a commutative weakly distancetransitive digraph of girth 2 is a distance-transitive graph. As an application of the result, we not only give some constructions of weakly distance-regular digraphs which are not weakly distance-transitive, but determine a special cla...
متن کاملCommutative weakly distance-regular digraphs of girth 2
We introduce some constructions of weakly distance-regular digraphs of girth 2, and prove that a certain quotient digraph of a commutative weakly distance-transitive digraph of girth 2 is a distancetransitive graph. As an application of the result, we obtain some examples of weakly distanceregular digraphs which are not weakly distance-transitive. Moreover, a class of commutative weakly distanc...
متن کاملTitle : A Family of Weakly Distance - Regular Digraphs of Girth
All weakly distance-regular digraphs with girth $2$ and k-k_{1,1}=1 are classified. A Family of Weakly Distance-Regular Digraphs of Girth 2 Kaishun Wang∗ School of Mathematical Sciences Beijing Normal University Beijing 100875, P.R. China Abstract All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 are classified.All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 ...
متن کاملWeakly Distance-Regular Digraphs of Valency Three, I
Suzuki (2004) classified thin weakly distance-regular digraphs and proposed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the third author (2004) under the assumption of the commutativity. In this paper, we continue this project and classify these digraphs with girth more than 2 and two types of arcs.
متن کاملA family of weakly distance-regular digraphs of girth 2
All weakly distance-regular digraphs with girth 2 and k − k1,1 = 1 are determined. Moreover, all such digraphs are commutative.
متن کاملDeza digraphs
We consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it is regular and the number of common out-neighbors of any two distinct vertices takes on at most two values. We introduce some constructions and develop some basic theory. In particular, constructions from Cayley digraphs, graph lexicograph products and graph directed products are described. Moreover, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 264 شماره
صفحات -
تاریخ انتشار 2003